Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Morvan, Michel")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 74

  • Page / 3
Export

Selection :

  • and

Bref plaidoyer pour l'origine commune des langues = Short pleading for the common origin of the languagesMORVAN, Michel.Bulletin du Musée basque. 2004, Num 163, pp 21-26, issn 1148-8395, 6 p.Article

Floats, integers, and single source shortest pathsTHORUP, M.Lecture notes in computer science. 1998, pp 14-24, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Languages defined with modular counting quantifiersSTRAUBING, H.Lecture notes in computer science. 1998, pp 332-343, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Minimum spanning trees for minor-closed graph classes in parallelGUSTEDT, J.Lecture notes in computer science. 1998, pp 421-431, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Recognizability equals Monadic second-order definability for sets of graphs of bounded tree-widthLAPOIRE, D.Lecture notes in computer science. 1998, pp 618-628, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Shuffle of ω-words : Algebraic aspectsMATEESCU, A.Lecture notes in computer science. 1998, pp 150-160, issn 0302-9743, isbn 3-540-64230-7Conference Paper

STRUCTURES ORDONNEES ET DYNAMIQUES DE PILES DE SABLE = ORDERED STRUTURES AND DYNAMICS OF SAND PILESPhan, Thi Ha Duong; Morvan, Michel.1999, 110 p.Thesis

On the expected number of nodes at level k in 0-balanced treesKEMP, R.Lecture notes in computer science. 1998, pp 566-576, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the structure of Valiant's complexity classesBÜRGISSER, P.Lecture notes in computer science. 1998, pp 194-204, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Algorithmes linéaires et invariants d'ordres = Linear algorithms and order invariantsMorvan, Michel; Habib, Michel.1991, 150 p.Thesis

STACS 98 : 15th annual symposium on theoretical aspects of computer science (Paris, 25-27 February 1998)Morvan, Michel; Meinel, Christoph; Krob, Daniel et al.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64230-7, XV, 630 p, isbn 3-540-64230-7Conference Proceedings

Lower bounds for randomized read-k-times branching programsSAUERHOFF, M.Lecture notes in computer science. 1998, pp 105-115, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Quelques algorithmes parallèles et séquentiels de traitement de graphes et applications = Parallel and Sequential Graph Algorithms and ApplicationsViennot, Laurent; Morvan, Michel.1996, 173 p.Thesis

On Batcher's merge sorts as parallel sorting algorithmsRÜB, C.Lecture notes in computer science. 1998, pp 410-420, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Coalescing Cellular AutomataROUQUIER, Jean-Baptiste; MORVAN, Michel.Lecture notes in computer science. 2006, pp 321-328, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Sur quelques aspects algorithmiques et structurels des treillis = On some strutural and algorithmic aspects on latticesBertet, Karell; Morvan, Michel.1998, 145 p.Thesis

Provable security for block ciphers by decorrelationVAUDENAY, S.Lecture notes in computer science. 1998, pp 249-275, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Sorting and searching on the word RAMHAGERUP, T.Lecture notes in computer science. 1998, pp 366-398, issn 0302-9743, isbn 3-540-64230-7Conference Paper

The mutual exclusion scheduling problem for permutation and comparability graphsJANSEN, K.Lecture notes in computer science. 1998, pp 287-297, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Algorithmes parallèles de traitement de graphes : une approche basée sur l'analyse expérimentale = Parallel graph algorithms : a study based on an experimental analysisGuerin Lassous, Isabelle; Morvan, Michel.1999, 142 p.Thesis

Axiomatizing the equational theory of regular tree languagesESIK, Z.Lecture notes in computer science. 1998, pp 455-465, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Hierarchies of principal twist-closed triosJANTZEN, M.Lecture notes in computer science. 1998, pp 344-355, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the existence of polynomial time approximation schemes for OBDD minimizationSIELING, D.Lecture notes in computer science. 1998, pp 205-215, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Radix representations of algebraic number fields and finite automataSAFER, T.Lecture notes in computer science. 1998, pp 356-365, issn 0302-9743, isbn 3-540-64230-7Conference Paper

A logical characterization of systolic languagesMONTI, A; PERON, A.Lecture notes in computer science. 1998, pp 466-476, issn 0302-9743, isbn 3-540-64230-7Conference Paper

  • Page / 3